I2VM: Incremental import vector machines

نویسندگان

  • Ribana Roscher
  • Wolfgang Förstner
  • Björn Waske
چکیده

a r t i c l e i n f o We introduce an innovative incremental learner called incremental import vector machines (I 2 VM). The kernel-based discriminative approach is able to deal with complex data distributions. Additionally, the learner is sparse for an efficient training and testing and has a probabilistic output. We particularly investigate the reconstructive component of import vector machines, in order to use it for robust incremental learning. By performing incre-mental update steps, we are able to add and remove data samples, as well as update the current set of model parameters for incremental learning. By using various standard benchmarks, we demonstrate how I 2 VM is competitive or superior to other incremental methods. It is also shown that our approach is capable of managing concept-drifts in the data distributions. Incremental learning methods have obtained large interest in areas in which a sequential data treatment is preferred, e.g. in tracking applications or time series analysis. Compared to batch learning methods in which data is available and simultaneously processable, incremental methods have to deal with sequentially incoming data, of which order and number can be arbitrary. A powerful incremental learning should have the following requirements: (a) It should perform comparably to its batch learning counterpart. When applied to the same data samples, it should be independent from the sequence of the data. Thus, it should be able to handle real or pseudo-concept-drifts in data distribution without suffering a loss in performance. (b) It should separate the classes well, regardless of the complexity of data distribution. (c) It should be able to deal with arbitrarily long data streams, e.g. in order to treat lifelong learning tasks. (d) It should provide reliable posterior probabilities in order to allow for a meaningful evaluation, to serve as input for further processing steps, as e.g. graphical models, or to provide criteria to decide on irrelevant data to keep the model sparse. To meet requirement (a) and (b), incremental methods in general need a reconstructive and should have a discriminative model component. A reconstructive model component represents the significant sub‐domain of the data distribution. It offers robustness against the sequence of data samples, as well as being effective in the case of many competing classes. Additionally, it is also capable of adapting to actual or apparent changes in the data distribution, which appear as concept-drifts to the learner, caused by either changes within …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Object Tracking by Segmentation Using Incremental Import Vector Machines

Zusammenfassung We propose a framework for object tracking in image sequences, following the concept of tracking-by-segmentation. The separation of object and background is achieved by a consecutive semantic superpi-xel segmentation of the images, yielding tight object boundaries. I.e., in the first image a model of the object's characteristics is learned from an initial, incomplete annotation....

متن کامل

Incremental training of support vector machines using hyperspheres

In the conventional incremental training of support vector machines, candidates for support vectors tend to be deleted if the separating hyperplane rotates as the training data are added. To solve this problem, in this paper, we propose an incremental training method using one-class support vector machines. First, we generate a hypersphere for each class. Then, we keep data that exist near the ...

متن کامل

Incremental Learning with Support Vector Machines

Support Vector Machines (SVMs) have become a popular tool for learning with large amounts of high dimensional data. However, it may sometimes be preferable to learn incrementally from previous SVM results, as computing a SVM is very costly in terms of time and memory consumption or because the SVM may be used in an online learning setting. In this paper an approach for incremental learning with...

متن کامل

On-line Support Vector Machines for Function Approximation

This paper describes an on-line method for building ε-insensitive support vector machines for regression as described in (Vapnik, 1995). The method is an extension of the method developed by (Cauwenberghs & Poggio, 2000) for building incremental support vector machines for classification. Machines obtained by using this approach are equivalent to the ones obtained by applying exact methods like...

متن کامل

Incremental Learning of Support Vector Machines by Classifier Combining

How to acquire new knowledge from new added training data while retaining the knowledge learned before is an important problem for incremental learning. In order to handle this problem, we propose a novel algorithm that enables support vector machines to accommodate new data, including samples that correspond to previously unseen classes, while it retains previously acquired knowledge. Furtherm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Image Vision Comput.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2012